Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
discrete Fourier transform - перевод на русский
![FFT]] algorithm computes one cycle of the DFT and its inverse is one cycle of the DFT inverse.](https://commons.wikimedia.org/wiki/Special:FilePath/From Continuous To Discrete Fourier Transform.gif?width=200 "FFT]] algorithm computes one cycle of the DFT and its inverse is one cycle of the DFT inverse.")
математика
алгоритм взаимодействия
![chord]]. The first three peaks on the left correspond to the frequencies of the [[fundamental frequency]] of the chord (C, E, G). The remaining smaller peaks are higher-frequency [[overtone]]s of the fundamental pitches. A [[pitch detection algorithm]] could use the relative intensity of these peaks to infer which notes the pianist pressed.](https://commons.wikimedia.org/wiki/Special:FilePath/CQT-piano-chord.png?width=200 "chord]]. The first three peaks on the left correspond to the frequencies of the [[fundamental frequency]] of the chord (C, E, G). The remaining smaller peaks are higher-frequency [[overtone]]s of the fundamental pitches. A [[pitch detection algorithm]] could use the relative intensity of these peaks to infer which notes the pianist pressed.")
![Animation showing the Fourier Transform of a time shifted signal. [Top] the original signal (yellow), is continuously time shifted (blue). [Bottom] The resultant Fourier Transform of the time shifted signal. Note how the higher frequency components revolve in complex plane faster than the lower frequency components.](https://commons.wikimedia.org/wiki/Special:FilePath/Fourier transform - time shifted signal.gif?width=200 "Animation showing the Fourier Transform of a time shifted signal. [Top] the original signal (yellow), is continuously time shifted (blue). [Bottom] The resultant Fourier Transform of the time shifted signal. Note how the higher frequency components revolve in complex plane faster than the lower frequency components.")
![The [[rectangular function]] is [[Lebesgue integrable]].](https://commons.wikimedia.org/wiki/Special:FilePath/Rectangular function.svg?width=200 "The [[rectangular function]] is [[Lebesgue integrable]].")
![The [[sinc function]], which is the Fourier transform of the rectangular function, is bounded and continuous, but not Lebesgue integrable.](https://commons.wikimedia.org/wiki/Special:FilePath/Sinc function (normalized).svg?width=200 "The [[sinc function]], which is the Fourier transform of the rectangular function, is bounded and continuous, but not Lebesgue integrable.")
медицина
преобразование Фурье
общая лексика
гармонический анализ
анализ Фурье
![JPEG DCT]]](https://commons.wikimedia.org/wiki/Special:FilePath/DCT-8x8.png?width=200 "JPEG DCT]]")
Смотрите также
общая лексика
(Indirect Discrete Cosine Transform) обратное дискретное косинусное преобразование
используется при декодировании сжатых данных
(inverse discrete cosine transform) инверсное дискретное косинусное преобразование
синоним
Смотрите также
математика
дискретное преобразование Лапласа
z-преобразование
Определение
Википедия
In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence. An inverse DFT (IDFT) is a Fourier series, using the DTFT samples as coefficients of complex sinusoids at the corresponding DTFT frequencies. It has the same sample-values as the original input sequence. The DFT is therefore said to be a frequency domain representation of the original input sequence. If the original sequence spans all the non-zero values of a function, its DTFT is continuous (and periodic), and the DFT provides discrete samples of one cycle. If the original sequence is one cycle of a periodic function, the DFT provides all the non-zero values of one DTFT cycle.
The DFT is the most important discrete transform, used to perform Fourier analysis in many practical applications. In digital signal processing, the function is any quantity or signal that varies over time, such as the pressure of a sound wave, a radio signal, or daily temperature readings, sampled over a finite time interval (often defined by a window function). In image processing, the samples can be the values of pixels along a row or column of a raster image. The DFT is also used to efficiently solve partial differential equations, and to perform other operations such as convolutions or multiplying large integers.
Since it deals with a finite amount of data, it can be implemented in computers by numerical algorithms or even dedicated hardware. These implementations usually employ efficient fast Fourier transform (FFT) algorithms; so much so that the terms "FFT" and "DFT" are often used interchangeably. Prior to its current usage, the "FFT" initialism may have also been used for the ambiguous term "finite Fourier transform".
